Ela Accurate and Efficient Ldu Decompositions of Diagonally Dominant M-matrices
نویسنده
چکیده
An efficient method for the computation to high relative accuracy of the LDU decomposition of an n × n row diagonally dominant M–matrix is presented, assuming that the off–diagonal entries and row sums are given. This method costs an additional O(n) elementary operations over the cost of Gaussian elimination, and leads to a lower triangular, column diagonally dominant matrix and an upper triangular, row diagonally dominant matrix. Comparisons with other methods in the literature are commented and illustrated.
منابع مشابه
New Relative Perturbation Bounds for Ldu Factorizations of Diagonally Dominant Matrices
This work introduces new relative perturbation bounds for the LDU factorization of (row) diagonally dominant matrices under structure-preserving componentwise perturbations. These bounds establish that if (row) diagonally dominant matrices are parameterized via their diagonally dominant parts and off-diagonal entries, then tiny relative componentwise perturbations of these parameters produce ti...
متن کاملA New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) diagonally dominant matrices computed via the column diagonal dominance pivoting strategy. This strategy yields L and U factors which are always well-conditioned and, so, the LDU factorization is guaranteed to be a rank-revealing decomposition. The new bound together with those for the D and U facto...
متن کاملPerturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices
We present a structured perturbation theory for the LDU factorization of (row) diagonally dominant matrices and we use this theory to prove that a recent algorithm of Ye (Math Comp 77(264):2195–2230, 2008) computes the L , D andU factors of these matrices with relative errors less than 14n3u, where u is the unit roundoff and n × n is the size of the matrix. The relative errors for D are compone...
متن کاملEla Schur Complements of Generally Diagonally Dominant Matrices and a Criterion for Irreducibility of Matrices∗
As is well known, the Schur complements of strictly or irreducibly diagonally dominant matrices are H−matrices; however, the same is not true of generally diagonally dominant matrices. This paper proposes some conditions on the generally diagonally dominant matrix A and the subset α ⊂ {1, 2, . . . , n} so that the Schur complement matrix A/α is an H−matrix. These conditions are then applied to ...
متن کاملRelative Perturbation Theory for Diagonally Dominant Matrices
OF DISSERTATION RELATIVE PERTURBATION THEORY FOR DIAGONALLY DOMINANT MATRICES Diagonally dominant matrices arise in many applications. In this work, we exploit the structure of diagonally dominant matrices to provide sharp entrywise relative perturbation bounds. We first generalize the results of Dopico and Koev to provide relative perturbation bounds for the LDU factorization with a well condi...
متن کامل